A Semiautomatic Method for History Matching Using Sequential Monte Carlo

نویسندگان

چکیده

The aim of the history matching method is to locate nonimplausible regions parameter space complex deterministic or stochastic models by model outputs with data. It does this via a series waves where at each wave an emulator fitted small number training samples. An implausibility measure defined which takes into account closeness simulated and observed as well uncertainty. As progress, becomes more accurate so that samples are concentrated on promising poorer parts rejected confidence. While has proved be useful, existing implementations not fully automated, some ad hoc choices made during process, involves user intervention time consuming. This occurs especially when region it difficult sample uniformly generate new points. In article we develop sequential Monte Carlo (SMC) algorithm for implementing semiautomated. Our novel SMC approach reveals yields can multimodal, highly irregular, very uniformly. offers much reliable sampling space, requires additional computation compared other approaches used in literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Graph Matching with Sequential Monte Carlo

We develop a novel probabilistic model for graph matchings and develop practical inference methods for supervised and unsupervised learning of the parameters of this model. The framework we develop admits joint inference on the parameters and the matchings. Furthermore, our framework generalizes naturally to K-partite hypergraph matchings or set packing problems. The sequential formulation of t...

متن کامل

Graph Matching via Sequential Monte Carlo

Graph matching is a powerful tool for computer vision and machine learning. In this paper, a novel approach to graph matching is developed based on the sequential Monte Carlo framework. By constructing a sequence of intermediate target distributions, the proposed algorithm sequentially performs a sampling and importance resampling to maximize the graph matching objective. Through the sequential...

متن کامل

Bayesian Phylogenetic Inference using a Combinatorial Sequential Monte Carlo Method

The application of Bayesian methods to large scale phylogenetics problems is increasingly limited by computational issues, motivating the development of methods that can complement existing Markov Chain Monte Carlo (MCMC) schemes. Sequential Monte Carlo (SMC) methods are approximate inference algorithms that have become very popular for time series models. Such methods have been recently develo...

متن کامل

Sequential Monte Carlo methods for Bayesian object matching

In dynamic state-space problems, Sequential Monte Carlo (SMC) methods are familiar techniques for obtaining samples from the Bayesian posterior distribution and updating the sample set as new observations arrive. The methods can also be applied in static problems by exposing the observations gradually. In our static object matching problem, we adopt a different approach; all the data is availab...

متن کامل

Sequential Noise Compensation by Sequential Monte Carlo Method

We present a sequential Monte Carlo method applied to additive noise compensation for robust speech recognition in time-varying noise. The method generates a set of samples according to the prior distribution given by clean speech models and noise prior evolved from previous estimation. An explicit model representing noise effects on speech features is used, so that an extended Kalman filter is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM/ASA Journal on Uncertainty Quantification

سال: 2021

ISSN: ['2166-2525']

DOI: https://doi.org/10.1137/19m1286694